Attribute-oriented Induction in Ob Ject-oriented Databases

نویسنده

  • Jinshi Xia
چکیده

Knowledge discovery in databases is the nontrivial extraction of implicit, previously unknown, and potentially useful information from data such that the extracted knowledge may facilitate deductive reasoning and query processing in database systems. This branch of study has been ranked among the most promising topics for database research for the 1990s. Due to the dominating influence of relational databases in many application fields, knowledge discovery from databases has been largely focused on relational databases. The gradual adoption of object-oriented database systems has expressed a need for the study of knowledge discovery from object-oriented databases as well. Object-oriented databases(O0DBs) are concerned with complex data structures and diverge greatly from relational database systems. In order to effectively conduct knowledge discovery in an object-oriented database, existing relational algorithms need be modified accordingly to take full advantage of the object-oriented data model. The attribute-oriented induction method has been successful for knowledge discovery in relational databases and we choose this method to study the new demands OODBs impose on a learning algorithm. In this thesis, we study the characteristics of the object-oriented data model and their effects on the attribute-oriented induction algorithm. We extend the attribute-oriented induction method to object-oriented paradigms, focusing on handling complex attributes, and present a algorithm for learning characteristic rules in an object-oriented database. We follow the least commitment principle and break down complex objects into primitive ones and then apply attribute-oriented generalization techniques. Learning in databases with a cycled class composition hierarchy is specifically addressed.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A formal basis for extending SQL to object-oriented databases

A formal basis for extending SQL in a natural way to complex ob ject databases is laid NSQL a language equivalent to the standard algebra for nested relational databases is obtained It is also shown that when allowing subqueries in the from clause the facility of sub queries in where clauses becomes redundant with regard to expressive power

متن کامل

An Extensible Object-Oriented Database Testbed

This paper describes the object-oriented design and implementation of an extensible schema manager for object-oriented databases. In order to achieve extensibility, we have adopted an open class hierarch y approach using an ob ject-oriented implementation where an object-oriented database maintains its implementation classes as user-defined classes. A Graphical interface for an Object-Qriented ...

متن کامل

Attribute-Oriented Induction in Relational Databases

It is beneficial as well as challenging to learn knowledge rules from relational databases because of the vast amount of knowledge implied in databases and the large amount of data stored in databases. In this thesis, we develop an attributeoriented induction method to extract characteristic rules and classification rules from relational databases. The method adopts the artificial intelligence ...

متن کامل

Exploration of the Power of Attribute-oriented Induction in Data Mining

Attribute-oriented induction is a set-oriented database mining method which generalizes the task-relevant subset of data attribute-by-attribute, compresses it into a generalized relation, and extracts from it the general features of data. In this chapter, the power of attribute-oriented induction is explored for the extraction from relational databases of diierent kinds of patterns, including c...

متن کامل

Knowledge Discovery in Databases : A Rule - Based Attribute - Oriented ApproachDavid

An attribute-oriented induction has been developed in the previous study of knowledge discovery in databases. A concept tree as-cension technique is applied in concept generalization. In this paper, we extend the background knowledge representation from an unconditional non-rule-based concept hierarchy to a rule-based concept hierarchy , which enhances greatly its representation power. An eecie...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005